Theory of Computation and Compilers - Turing Machines

1. Which of the following is complement of a?

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


2. If nL can be recognized by a multitape TM with time complexity f, then L can be recognized by a one-tape machine with time complexity DSD

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


3. If T is a TM recognizing L, and T reads every symbol in the input string, τT(n) ≥ 2n + 2, then any language that can be accepted by a TM T with τT(n) = 2n + 2 is

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


4. Consider an alternate Turing machine model, in which there is an input tape on which the tape head can move in both directions but cannot write, and one or more work tapes, one of which serves as an output tape. For a function f, denoted by DSpace ( f ), the set of languages that can be recognized by a Turning machine of this type which uses no more than f(n) squares on any work tape for any input string of length n. The only restriction we need to make on f is that f(n) > 0 for every n. The language of balanced strings of parentheses are in

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


5. Which of the following problems is solvable?

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


  • Turing Machines Questions can be used to give quizzes by any candidate who is preparing for UGC NET Computer Science
  • This Turing Machines Questions section will help you test your analytical skills in a tricky method, thereby giving you an edge over other students
  • Any student who wants to prepare for DOEACC A Level, DOEACC B Level, and DOEACC C level can also use these Objective Type Questions Answer.
  • All candidates who have to appear for the Kendriya Vidyalaya Entrance exam can also refer to this mcq section.
  • You can also get access to the Turing Machines MCQ ebook.
  • Turing Machines Questions can be used in the preparation of JRF, CSIR, and various other exams.
  • You can also download pdf for these Turing Machines multiple-choice questions Answers.
  • This Turing Machines Multiple Choice Questions Answers section can also be used for the preparation of various competitive exams like UGC NET, GATE, PSU, IES, and many more.
  • Turing Machines Questions can be used to gain a credit score in various undergraduate and postgraduate courses like BSc, MSc and MCA
  • Turing Machines Questions for UGC NET Computer Science

    Turing Machines MCQ

    Turing Machines Multiple choice questions